Hypergraph functor and attachment

نویسنده

  • Sergejs Solovjovs
چکیده

Since the inception of the notion of fuzzy topology much attention was paid to the possible means of interaction between fuzzy and crisp topological settings, in order to see whether fuzzy topology was doing anything new. In particular, different functors relating the categories Top of topological spaces and L-Top of Ltopological spaces (L being a suitable complete lattice) appeared in the literature, providing the desired machinery for comparing classical and fuzzy developments. One of the mo st important examples in the field is hypergraph functor. Initiated by R. Lowen [8] and E. S. Santos [13], the concept was studied by many researchers [4],[6],[7],[11], but still failed to gai n much prominence in the fuzzy community. The main reasons were, firstly, the lack of information on functorial properties of the hypergraph functor and, secondly, remarkable differences in its definition by various authors (cf., e.g., those of U. Höhl e [6] and S. E. Rodabaugh [11]). There has been several attempts to amend the situation. The former of the above-mentioned deficiencies was partly removed by W. Kotzé, T. Kubiak [7] and U. Höhle [6] by considering the hypergraph functor from the categorical poin t of view. The second deficiency, however, appeared more resistant and was approached to only recently by C. Guido [5]. Motivated by the concept of quasicoincidence [9] (which is an analogue of the intersection property for fuzzy sets), he introduced the notion of attachment on a complete lattice as follows.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fuzzy points and attachment

In this paper a binary relation between L-sets, called attachment, is defined by means of a suitable family of completely coprime filters in L. Examples are given using several kinds of lattice-ordered algebras and a class of attachments is determined whose elements generalize Pu-Liu’s quasi-coincidence relation. Mapping any L-set on X to the set of the attached L-points one gets a frame map fr...

متن کامل

CATEGORY OF (POM)L-FUZZY GRAPHS AND HYPERGRAPHS

In this note by considering a complete lattice L, we define thenotion of an L-Fuzzy hyperrelation on a given non-empty set X. Then wedefine the concepts of (POM)L-Fuzzy graph, hypergraph and subhypergroupand obtain some related results. In particular we construct the categories ofthe above mentioned notions, and give a (full and faithful) functor form thecategory of (POM)L-Fuzzy subhypergroups ...

متن کامل

Analysis of Hypergraph Transformation Systems in AGG based on M-Functors

Hypergraph transformation systems are examples of M -adhesive transformation systems based on M -adhesive categories. For typed attributed graph transformation systems, the tool environment AGG allows the modelling, the simulation and the analysis of graph transformations. A corresponding tool for analysis of hypergraph transformation systems does not exist up to now. The purpose of this paper ...

متن کامل

Random Preferential Attachment Hypergraphs

The random graph model has recently been extended to a random preferential attachment graph model, in order to enable the study of general asymptotic properties in network types that are better represented by the preferential attachment evolution model than by the ordinary (uniform) evolution lodel. Analogously, this paper extends the random hypergraph model to a random preferential attachment ...

متن کامل

On the Pixel Expansion of Hypergraph Access Structures in Visual Cryptography Schemes

In a visual cryptography scheme, a secret image is encoded into n shares, in the form of transparencies. The shares are then distributed to n participants. Qualified subsets of participants can recover the secret image by superimposing their transparencies, but non-qualified subsets of participants have no information about the secret image. Pixel expansion, which represents the number of subpi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010